منابع مشابه
Bisimulation for Conditional Modalities
We give a general definition of bisimulation for conditional modalities interpreted on selection functions and prove the correspondence between bisimilarity and modal equivalence. We describe how this framework specializes to unary modalities and further investigate the operators and semantics to which these results apply. First, we show that our models encompass both Grove’s sphere models and ...
متن کاملGraded Modalities and Resource Bisimulation
The logical characterization of the strong and the weak (ignoring silent actions) versions of resource bisimulation are studied. The temporal logics we introduce are variants of Hennessy-Milner Logics that use graded modalities instead of the classical box and diamond operators. The considered strong bisimulation induces an equivalence that, when applied to labelled transition systems, permits ...
متن کاملBisimulation for BL-general fuzzy automata
In this note, we define bisimulation for BL-general fuzzy automata and show that if there is a bisimulation between two BL-general fuzzy automata, then they have the same behavior.For a given BL-general fuzzy automata, we obtain the greatest bisimulation for the BL-general fuzzy automata. Thereafter, if we use the greatest bisimulation, then we obtain a quotient BL-general fuzzy automata and th...
متن کاملBisimulation and expressivity for conditional belief, degrees of belief, and safe belief
Plausibility models are Kripke models that agents use to reason about knowledge and belief, both of themselves and of each other. Such models are used to interpret the notions of conditional belief, degrees of belief, and safe belief. The logic of conditional belief contains that modality and also the knowledge modality, and similarly for the logic of degrees of belief and the logic of safe bel...
متن کاملDivide and Congruence: From Decomposition of Modalities to Preservation of Branching Bisimulation
We present a method for decomposing modal formulas for processes with the internal action τ . To decide whether a process algebra term satisfies a modal formula, one can check whether its subterms satisfy formulas that are obtained by decomposing the original formula. The decomposition uses the structural operational semantics that underlies the process algebra. We use this decomposition method...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2017
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-017-9723-2